package lanqiao;

public class gcd {
    public static void main(String[] args) {
        long[] arr=new long[2020];
        arr[0]=1;
        arr[1]=1;
        int i =2;
        while (i<2020){
            arr[i]=arr[i-1]+arr[i-2];
            i++;
        }
        System.out.println(arr[2019]);
        System.out.println(arr[519]);
        long m =arr[2019];
        long n = arr[519];
        long res = 0;
        for (long j = n; j>=1 ; j--) {
            if (m%j==0 && n%j==0){
                res=j;
                break;
            }
        }
        System.out.println(res);
    }
}
